Lower bounds for the probability of a union via chordal graphs
نویسندگان
چکیده
منابع مشابه
Lower bounds for the probability of a union via chordal graphs
We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملsome lower bounds for the $l$-intersection number of graphs
for a set of non-negative integers~$l$, the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$. the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملLower Bounds on the Probability of a Finite Union of Events
In this paper, lower bounds on the probability of a finite union of events are considered, i.e. P (
متن کاملEdge Lower Bounds for List Critical Graphs, via Discharging
A graph G is k-critical if G is not (k − 1)-colorable, but every proper subgraph of G is (k − 1)-colorable. A graph G is k-choosable if G has an L-coloring from every list assignment L with |L(v)| = k for all v, and a graph G is k-list-critical if G is not (k − 1)-choosable, but every proper subgraph of G is (k − 1)-choosable. The problem of bounding (from below) the number of edges in a k-crit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2013
ISSN: 1083-589X
DOI: 10.1214/ecp.v18-2357